Decision Network Semantics of Branching Constraint Satisfaction Problems
نویسندگان
چکیده
Branching Constraint Satisfaction Problems (BCSPs) have been introduced to model dynamic resource allocation subject to constraints and uncertainty. We give BCSPs a formal probability semantics by showing how they can be mapped to a certain class of Bayesian decision networks.
منابع مشابه
Scheduling for an Uncertain Future with Branching Constraint Satisfaction Problems
Agents which schedule tasks must deal with problems that change as time progresses, often while the problem is being solved. In this paper, we assume that the agent does not blindly react to events, but uses knowledge of likely changes to make decisions in the present that will facilitate future actions. To solve this problem, we introduce the branching CSP, a new variant of the constraint sati...
متن کاملStochastic Constraint Programming
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision variables (which we can set) and stochastic variables (which follow a probability distribution). They combine together the best features of traditional constraint satisfaction, stochastic integer programming, and sto...
متن کاملA Framework for Representing and Solving NP Search Problems
NP search and decision problems occur widely in AI, and a number of general-purpose methods for solving them have been developed. The dominant approaches include propositional satisfiability (SAT), constraint satisfaction problems (CSP), and answer set programming (ASP). Here, we propose a declarative constraint programming framework which we believe combines many strengths of these approaches,...
متن کاملUsing nogoods information from restarts in domain-splitting search
The use of restart techniques associated with learning nogoods in solving Constraint Satisfaction Problems (CSPs) is starting to be considered of major importance for backtrack search algorithms. In a backtracking search algorithm, with domain-splitting branching, nogoods can be learned from the last branch of the search tree, immediately before the restart occurs. This type of nogoods, named d...
متن کاملA best - rst - search approach to constraint satisfaction problems ∗
Backtrack-style exhaustive search algorithms for NP-hard problems, such as constraint satisfaction, tend to have large variance in their runtime. This is because fortunate branching decisions can lead to nding a solution quickly, whereas unfortunate decisions in another run can lead the algorithm to a region of the search space with no solutions. In this paper, we show how a bestrst-search heur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003